Total Order Multicast to Multiple Groups Rachid

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Contact: Manager, Copyrights and Permissions Abstract We present a fault-tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group \gen-uine" multicast algorithm in the sense that (1) any process can send a message to any set of process groups, and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The correctness of our algorithm does not require reliable failure detectors, but requires causal order delivery of messages. This establishes a new and interesting link between causal order delivery and fault-tolerance with unreliable failure detectors.